NSF Highlights Fundamental Limit of Error-Correction Achieved
نویسنده
چکیده
منابع مشابه
Probability 1 computation with chemical reaction networks ∗ Rachel Cummings
The computational power of stochastic chemical reaction networks (CRNs) varies significantly with the output convention and whether or not error is permitted. Focusing on probability 1 computation, we demonstrate a striking difference between stable computation that converges to a state where the output cannot change, and the notion of limit-stable computation where the output eventually stops ...
متن کاملEntanglement purification and quantum error correction
We give a review on entanglement purification for bipartite and multipartite quantum states, with the main focus on theoretical work carried out by our group in the last couple of years. We discuss entanglement purification in the context of quantum communication, where we emphasize its close relation to quantum error correction. Various bipartite and multipartite entanglement purification prot...
متن کاملOn the Achievable Information Rate of Asymmetric Optical Fiber Channels with Amplifier Spontaneous Emission Noise
This work is motivated by the need to understand the fundamental limit of channel capacities of optical fiber communication channels where amplified spontaneous emission (ASE) noise is dominant and to understand how much has been achieved by the stateof-the-art forward error correction (FEC) coding techniques. Two most commonly used channel models, the Chi-square channel and its Gaussian approx...
متن کاملIncreasing sensing resolution with error correction.
The signal to noise ratio of quantum sensing protocols scales with the square root of the coherence time. Thus, increasing this time is a key goal in the field. By utilizing quantum error correction, we present a novel way of prolonging such coherence times beyond the fundamental limits of current techniques. We develop an implementable sensing protocol that incorporates error correction, and d...
متن کاملLocally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound
One of the most important open problems in the theory of error-correcting codes is to determine the tradeoff between the rate R and minimum distance δ of a binary code. The best known tradeoff is the Gilbert-Varshamov bound, and says that for every δ ∈ (0, 1/2), there are codes with minimum distance δ and rate R = RGV(δ) > 0 (for a certain simple function RGV(·)). In this paper we show that the...
متن کامل